package com.leetcode.partition14;

/**
 * @author rkc
 * @date 2022/8/30 9:20
 */
public class LC1359有效的快递序列数目 {

    private final int MOD = (int) (1e9 + 7);

    public int countOrders(int n) {
        int ans = 1;
        for (int i = 2; i <= n; i++) ans = (int) (ans * (i * 2L - 1) % MOD * i % MOD);
        return ans;
    }
}
